Pareto Front Learning (PFL) was recently introduced as an effective approach to obtain a mapping function from a given trade-off vector to a solution on the Pareto front, which solves the multi-objective optimization (MOO) problem. Due to the inherent trade-off between conflicting objectives, PFL offers a flexible approach in many scenarios in which the decision makers can not specify the preference of one Pareto solution over another, and must switch between them depending on the situation. However, existing PFL methods ignore the relationship between the solutions during the optimization process, which hinders the quality of the obtained front. To overcome this issue, we propose a novel PFL framework namely \ourmodel, which employs a hypernetwork to generate multiple solutions from a set of diverse trade-off preferences and enhance the quality of the Pareto front by maximizing the Hypervolume indicator defined by these solutions. The experimental results on several MOO machine learning tasks show that the proposed framework significantly outperforms the baselines in producing the trade-off Pareto front.

元学习是一种处理不平衡和嘈杂标签学习的有效方法，但它取决于验证集，其中包含随机选择，手动标记和平衡的分布式样品。该验证集的随机选择和手动标记和平衡不仅是元学习的最佳选择，而且随着类的数量，它的缩放范围也很差。因此，最近的元学习论文提出了临时启发式方法来自动构建和标记此验证集，但是这些启发式方法仍然是元学习的最佳选择。在本文中，我们分析了元学习算法，并提出了新的标准来表征验证集的实用性，基于：1）验证集的信息性； 2）集合的班级分配余额； 3）集合标签的正确性。此外，我们提出了一种新的不平衡的嘈杂标签元学习（INOLML）算法，该算法会自动构建通过上面的标准最大化其实用程序来构建验证。我们的方法比以前的元学习方法显示出显着改进，并在几个基准上设定了新的最新技术。

成功的人工智能系统通常需要大量标记的数据来从文档图像中提取信息。在本文中，我们研究了改善人工智能系统在理解文档图像中的性能的问题，尤其是在培训数据受到限制的情况下。我们通过使用加强学习提出一种新颖的填充方法来解决问题。我们的方法将信息提取模型视为策略网络，并使用策略梯度培训来更新模型，以最大程度地提高补充传统跨凝结损失的综合奖励功能。我们使用标签和专家反馈在四个数据集上进行的实验表明，我们的填充机制始终提高最先进的信息提取器的性能，尤其是在小型培训数据制度中。

我们考虑在非负轨道中包含的半格式集中的多项式优化问题（POP）（紧凑型集合上的每个POP都可以通过对Origin的简单翻译来以这种格式放置）。通过将每个变量平行，可以将这样的POP转换为等效的POP。使用偶数对称性和因子宽度的概念，我们根据Dickinson-Povh提出了基于P \'Olya的Potitivstellensatz的扩展，提出了半决赛弛豫的层次结构。作为其显着特征和关键特征，可以任意选择每个结果的半芬特弛豫的最大矩阵大小，此外，我们证明了新层次结构返回的值的序列收敛到原始POP的最佳值，以$ o的速率$ o。 （\ varepsilon^{ - c}）$如果半gebraic集具有非空内饰。当应用于（i）多层神经网络的鲁棒性认证和（ii）计算积极的最大奇异值时，我们的方法基于p \'olya的Potitivstellensatz提供了更好的界限，并且比标准瞬间层次结构更快地运行了几百倍。

鉴于在各种条件和背景下捕获的图像的识别药物已经变得越来越重要。已经致力于利用基于深度学习的方法来解决文献中的药丸识别问题。但是，由于药丸的外观之间的相似性很高，因此经常发生错误识别，因此识别药丸是一个挑战。为此，在本文中，我们介绍了一种名为Pika的新颖方法，该方法利用外部知识来增强药丸识别精度。具体来说，我们解决了一种实用的情况（我们称之为上下文药丸识别），旨在在患者药丸摄入量的情况下识别药丸。首先，我们提出了一种新的方法，用于建模在存在外部数据源的情况下，在这种情况下，在存在外部处方的情况下，药丸之间的隐式关联。其次，我们提出了一个基于步行的图形嵌入模型，该模型从图形空间转换为矢量空间，并提取药丸的凝结关系。第三，提供了最终框架，该框架利用基于图像的视觉和基于图的关系特征来完成药丸识别任务。在此框架内，每种药丸的视觉表示形式都映射到图形嵌入空间，然后用来通过图表执行注意力，从而产生了有助于最终分类的语义丰富的上下文矢量。据我们所知，这是第一项使用外部处方数据来建立药物之间的关联并使用此帮助信息对其进行分类的研究。皮卡（Pika）的体系结构轻巧，并且具有将识别骨架纳入任何识别骨架的灵活性。实验结果表明，通过利用外部知识图，与基线相比，PIKA可以将识别精度从4.8％提高到34.1％。

尽管在自动语音识别（ASR）中最近的表现方法增加了，但这种方法并不能确保其输出的适当套管和标点符号。这个问题对自然语言处理（NLP）算法和人类的理解都有重大影响。对于原始文本输入的预处理管道，必须进行资本化和标点符号恢复。对于越南人等低资源语言，此任务的公共数据集很少。在本文中，我们为越南人的资本化和标点符号恢复贡献了一个公共数据集；并提出了两个名为intercappunc的任务的联合模型。越南数据集的实验结果显示了我们联合模型的有效性与单个模型和先前的联合学习模型相比。我们在https://github.com/anhtunguyen98/jointcappund上公开发布数据集和模型的实现

机器学习（ML）模型需要经常在改变各种应用场景中更改数据集，包括数据估值和不确定量化。为了有效地重新培训模型，已经提出了线性近似方法，例如影响功能，以估计数据变化对模型参数的影响。但是，对于大型数据集的变化，这些方法变得不准确。在这项工作中，我们专注于凸起的学习问题，并提出了一般框架，用于学习使用神经网络进行不同训练集的优化模型参数。我们建议强制执行预测的模型参数，以通过正则化技术遵守最优性条件并保持效用，从而显着提高泛化。此外，我们严格地表征了神经网络的表现力，以近似凸起问题的优化器。经验结果展示了与最先进的准确高效的模型参数估计中提出的方法的优点。

In this work, we propose a new approach that combines data from multiple sensors for reliable obstacle avoidance. The sensors include two depth cameras and a LiDAR arranged so that they can capture the whole 3D area in front of the robot and a 2D slide around it. To fuse the data from these sensors, we first use an external camera as a reference to combine data from two depth cameras. A projection technique is then introduced to convert the 3D point cloud data of the cameras to its 2D correspondence. An obstacle avoidance algorithm is then developed based on the dynamic window approach. A number of experiments have been conducted to evaluate our proposed approach. The results show that the robot can effectively avoid static and dynamic obstacles of different shapes and sizes in different environments.

We introduce an approach for the answer-aware question generation problem. Instead of only relying on the capability of strong pre-trained language models, we observe that the information of answers and questions can be found in some relevant sentences in the context. Based on that, we design a model which includes two modules: a selector and a generator. The selector forces the model to more focus on relevant sentences regarding an answer to provide implicit local information. The generator generates questions by implicitly combining local information from the selector and global information from the whole context encoded by the encoder. The model is trained jointly to take advantage of latent interactions between the two modules. Experimental results on two benchmark datasets show that our model is better than strong pre-trained models for the question generation task. The code is also available (shorturl.at/lV567).

Machine Learning as a service (MLaaS) permits resource-limited clients to access powerful data analytics services ubiquitously. Despite its merits, MLaaS poses significant concerns regarding the integrity of delegated computation and the privacy of the server's model parameters. To address this issue, Zhang et al. (CCS'20) initiated the study of zero-knowledge Machine Learning (zkML). Few zkML schemes have been proposed afterward; however, they focus on sole ML classification algorithms that may not offer satisfactory accuracy or require large-scale training data and model parameters, which may not be desirable for some applications. We propose ezDPS, a new efficient and zero-knowledge ML inference scheme. Unlike prior works, ezDPS is a zkML pipeline in which the data is processed in multiple stages for high accuracy. Each stage of ezDPS is harnessed with an established ML algorithm that is shown to be effective in various applications, including Discrete Wavelet Transformation, Principal Components Analysis, and Support Vector Machine. We design new gadgets to prove ML operations effectively. We fully implemented ezDPS and assessed its performance on real datasets. Experimental results showed that ezDPS achieves one-to-three orders of magnitude more efficient than the generic circuit-based approach in all metrics while maintaining more desirable accuracy than single ML classification approaches.